Analysis of packet switches with input and output queuing

نویسندگان

  • Ilias Iliadis
  • Wolfgang E. Denzel
چکیده

For advanced packet switches, output queueing has received increased attention owing to its performance advantages. However, practical output queue size limitations may require additional queueing at the inputs. This paper considers a single-stage nonblocking N x N packet switch with both output and input queueing. The limited queueing at the output ports resolves output port contention partially. Overflow at the output queues is prevented by a backpressure mechanism and additional queueing at the input ports. This paper analyzes the impact of the backpressure effect on the switch performance for arbitrary output buffer sizes and for large N ( N -t 00). ’ h o different switch models are considered: a asynchronous model with Poisson arrivals and a synchronous model with Bernoulli arrivals. The investigation is based on two performance measures: the average delay and the maximum throughput of the switch. Closed-form expressions for these measures are derived for both models in the case of operation with fixed size packets. The obtained results demonstrate that a modest amount of output queueing, in conjunction with appropriate switch speedup, provides significant delay and throughput improvements over pure input queueing. With justifiable output buffer sizes, the ideal performance of infinite output queueing can be closely approached. The maximum throughput is the same for the synchronous as well as the asynchronous switch model, although the delay is different.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High Speed Networks SCHEDULING IN INPUT-QUEUED CELL-BASED PACKET SWITCHES*

Input queuing switch architectures must be controlled by a scheduling algorithm, which solves contentions in the transfer of data units from inputs to outputs. Several scheduling algorithms were proposed in the literature for switches operating onfied-size data units. In this paper we consider the case of packet switches, i.e., devices operating on variablesize data units at their interfaces, b...

متن کامل

Scheduling in Input-queued Cell-based Packet Switches

Input queuing switch architectures must be controlled by a scheduling algorithm, which solves contentions in the transfer of data units from inputs to outputs. Several scheduling algorithms were proposed in the literature for switches operating on fixed-size data units. In this paper we consider the case of packet switches, i.e., devices operating on variablesize data units at their interfaces,...

متن کامل

A combined low Latency and Weighted Fair Queuing based Scheduling of an input-Queued Switch

Input queuing has become dominant and popular building blocks for high speed crossbar switches with many ports and fast line rates because they require minimum speed-up of memory bandwidth. Input Queued switches with finite Virtual Output Queues guarantees QoS performance in terms of throughput and average delay. A switch performs two functions Queuing and Scheduling. Queue Management algorithm...

متن کامل

Variable Length Packet Switches: Delay Analysis of Crossbar Switches under Poisson and Self Similar Traffic

We consider crossbar switches for switching variable length packets. Analysis of such switches is important in the context of IP switches where the packet interarrival times and packet lengths are drawn from continuous distributions. Assuming a single stage M N switch we obtain a very general throughput delay model for Poisson packet arrivals and exponential service times. We then analyze an M ...

متن کامل

An O(log2N) parallel algorithm for output queuing

Output queued switches are appealing because they have better latency and throughput than input queued switches. However, they are difficult to build: a direct implementation of an N × N output-queued switch requires the switching fabric and the packet memories at the outputs to run at N times the line rate. Attempts have been made to implement output queuing with slow components, e.g., by havi...

متن کامل

Input-queued router architectures exploiting cell-based switching fabrics

Input queued and combined input/output-queued architectures have recently come to play a major role in the design of high-performance switches and routers for packet networks. These architectures must be controlled by a packet scheduling algorithm, which solves contentions in the transfer of data units to switch outputs. Several scheduling algorithms were proposed in the literature for switches...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEEE Trans. Communications

دوره 41  شماره 

صفحات  -

تاریخ انتشار 1993